List Factoring and Relative Worst Order Analysis
نویسندگان
چکیده
منابع مشابه
Relative Worst-Order Analysis: A Survey
Relative worst-order analysis is a technique for assessing the relative quality of online algorithms. We survey the most important results obtained with this technique and compare it with other quality measures.
متن کاملSeparating Scheduling Algorithms with the Relative Worst Order Ratio
The relative worst order ratio is a measure for the quality of online algorithms. Unlike the competitive ratio, it compares algorithms directly without involving an optimal offline algorithm. The measure has been successfully applied to problems like paging and bin packing. In this paper, we apply it to machine scheduling. We show that for preemptive scheduling, the measure separates multiple p...
متن کاملSeparating online scheduling algorithms with the relative worst order ratio
The relative worst order ratio is a measure for the quality of online algorithms. Unlike the competitive ratio, it compares algorithms directly without involving an optimal offline algorithm. The measure has been successfully applied to problems like paging and bin packing. In this paper, we apply it to machine scheduling. We show that for preemptive scheduling, the measure separates multiple p...
متن کاملAccess Graphs Results for LRU versus FIFO under Relative Worst Order Analysis
Access graphs, which have been used previously in connection with competitive analysis to model locality of reference in paging, are considered in connection with relative worst order analysis. In this model, FWF is shown to be strictly worse than both LRU and FIFO on any access graph. LRU is shown to be strictly better than FIFO on paths and cycles, but they are incomparable on some families o...
متن کاملOrder-p Tensors: Factoring and Applications
Saturday 10:15 – 12:15 Carol Woodward, LLNL Victoria Howle, Texas Tech Misha Kilmer, Tufts University Carla D. Martin, James Madison University Saturday 3:15 – 5:15 Jingmei Qiu, Colorado School of Mines Fengyan Li, Rensselaer Polytechnic Institute Lorena Barba, Boston University Sarah Olson, WPI (as of Fall 2011) Saturday 10:15 – 12:15 Accelerated Fixed Point Methods for Subsurface Flow Problem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2012
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-012-9637-3